# -*- coding:utf-8 -*-
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    # 返回构造的TreeNode根节点
    def reConstructBinaryTree(self, pre, tin):
		if len(pre)==0:
			return None
		rootNode = TreeNode(pre[0])
		index = tin.index(pre[0])
		rootNode.left = self.reConstructBinaryTree(pre[1:index+1],tin[0:index])
		rootNode.right = self.reConstructBinaryTree(pre[index+1:],tin[index+1:])
		return rootNode